Counting the number of Sudoku’s by importance sampling simulation
نویسنده
چکیده
Stochastic simulation can be applied to estimate the number of feasible solutions in a combinatorial problem. This idea will be illustrated to count the number of possible Sudoku grids. It will be argued why this becomes a rare-event simulation, and how an importance sampling algorithm resolves this difficulty.
منابع مشابه
Efficient Importance Sampling for Binary Contingency Tables
Importance sampling has been reported to produce algorithms with excellent empirical performance in counting problems. However, the theoretical support for its efficiency in these applications has been very limited. In this paper, we propose a methodology that can be used to design efficient importance sampling algorithms for counting and test their efficiency rigorously. We apply our technique...
متن کاملApproximate Counting by Sampling the Backtrack-free Search Space
We present a new estimator for counting the number of solutions of a Boolean satisfiability problem as a part of an importance sampling framework. The estimator uses the recently introduced SampleSearch scheme that is designed to overcome the rejection problem associated with distributions having a substantial amount of determinism. We show here that the sampling distribution of SampleSearch ca...
متن کاملAN ADAPTIVE IMPORTANCE SAMPLING-BASED ALGORITHM USING THE FIRST-ORDER METHOD FOR STRUCTURAL RELIABILITY
Monte Carlo simulation (MCS) is a useful tool for computation of probability of failure in reliability analysis. However, the large number of samples, often required for acceptable accuracy, makes it time-consuming. Importance sampling is a method on the basis of MCS which has been proposed to reduce the computational time of MCS. In this paper, a new adaptive importance sampling-based algorith...
متن کاملStochastic Enumeration and Splitting Methods for Counting Self-Avoiding Walks
We present a new method for counting self-avoiding walks (SAW’s), called stochastic enumeration (SE), a stochastic replica of the naive (computationally intractable) full enumeration method. Also presented is a new approach, called OSLA-SPLIT, a combination of classic splitting with importance sampling. The latter is based on the well-known method, onestep-look-ahead (OSLA) method. Polynomial c...
متن کاملAn Efficient Algorithm for Rare-event Probability Estimation, Combinatorial Optimization, and Counting
Although importance sampling is an established and effective sampling and estimation technique, it becomes unstable and unreliable for highdimensional problems. The main reason is that the likelihood ratio in the importance sampling estimator degenerates when the dimension of the problem becomes large. Various remedies to this problem have been suggested, including heuristics such as resampling...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010